-
1 рекурсивно инвариантный
Русско-английский научно-технический словарь Масловского > рекурсивно инвариантный
-
2 рекурсивно инвариантное отношение
Русско-английский научно-технический словарь Масловского > рекурсивно инвариантное отношение
-
3 рекурсивно инвариантное понятие
Русско-английский научно-технический словарь Масловского > рекурсивно инвариантное понятие
-
4 рекурсивно инвариантное отношение
Mathematics: recursively invariant relationУниверсальный русско-английский словарь > рекурсивно инвариантное отношение
-
5 рекурсивно инвариантное понятие
Mathematics: recursively invariant conceptУниверсальный русско-английский словарь > рекурсивно инвариантное понятие
См. также в других словарях:
Kalman filter — Roles of the variables in the Kalman filter. (Larger image here) In statistics, the Kalman filter is a mathematical method named after Rudolf E. Kálmán. Its purpose is to use measurements observed over time, containing noise (random variations)… … Wikipedia
List of first-order theories — In mathematical logic, a first order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties. PreliminariesFor every natural mathematical structure… … Wikipedia
Newton's identities — In mathematics, Newton s identities, also known as the Newton–Girard formulae, give relations between two types of symmetric polynomials, namely between power sums and elementary symmetric polynomials. Evaluated at the roots of a monic polynomial … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Harris affine region detector — In the fields of computer vision and image analysis, the Harris affine region detector belongs to the category of feature detection. Feature detection is a preprocessing step of several algorithms that rely on identifying characteristic points or … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Knot theory — A three dimensional depiction of a thickened trefoil knot, the simplest non trivial knot … Wikipedia
Memoization — Not to be confused with Memorization. In computing, memoization is an optimization technique used primarily to speed up computer programs by having function calls avoid repeating the calculation of results for previously processed inputs.… … Wikipedia
Alternatives to general relativity — are physical theories that attempt to describe the phenomena of gravitation in competition to Einstein s theory of general relativity.There have been many different attempts at constructing an ideal theory of gravity. These attempts can be split… … Wikipedia